An O (n 2 (m + N log n )log n ) min-cost flow algorithm
نویسندگان
چکیده
منابع مشابه
An O(n)-space O(log N= Log Log N + F )-query Time Algorithm for 3-d Dominance Reporting
We present a linear-space algorithm for handling the three-dimensional dominance reporting problem: given a set S of n three-dimensional points, design a data structure for S so that the points in S which dominate a given query point can be reported quickly. Under the variation of the RAM model introduced by Fredman and Willard 8], our algorithm achieves O(log n= loglog n + f) query time, where...
متن کاملAn O(log n/ log log n)-approximation Algorithm for the Asymmetric Traveling Salesman Problem
We consider the Asymmetric Traveling Salesman problem for costs satisfying the triangle inequality. We derive a randomized algorithm which delivers a solution within a factor O(log n/ log log n) of the optimum with high probability.
متن کاملAn O ( n log n ) Algorithm for nding Dissimilar
Let be a nite alphabet and x 2 n. A string y 2 m is said to be k-dissimilar to x, if no k length substring of x is equal to any k length substring of y. We present an O(n log n) algorithm which on input x 2 n and an integer m n outputs an integer k and y 2 m such that: { y is k-dissimilar to x. { There does not exist a string z of length m which is k ? 1 dissimilar to x.
متن کاملAn O ( n log n ) Algorithm for nding
Let be a nite alphabet and x 2 n. A string y 2 m is said to be k-dissimilar to x, if no k length substring of x is equal to any k length substring of y. We present an O(n log n) algorithm which on input x 2 n and an integer m n outputs an integer k and y 2 m such that: y is k-dissimilar to x. There does not exist a string z of length m which is k ? 1 dissimilar to x.
متن کاملStUSPACE(log n) <= DSPACE(log²n / log log n)
We present a deterministic algorithm running in space O ? log 2 n= log logn solving the connectivity problem on strongly unambiguous graphs. In addition, we present an O(logn) time-bounded algorithm for this problem running on a parallel pointer machine.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the ACM
سال: 1988
ISSN: 0004-5411,1557-735X
DOI: 10.1145/42282.214090